PREDICTOR-CORRECTOR DOMAIN DECOMPOSITION ALGORITHM FOR PARABOLIC PROBLEMS ON GRAPHS

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Paralel Predictor-Corrector Schemes for Parabolic Problems on Graphs

We consider a predictor-corrector type finite difference scheme for solving one-dimensional parabolic problems. This algorithm decouples computations on different subdomains and thus can be efficiently implemented on parallel computers and used to solve problems on graph structures. The stability and convergence of the discrete solution is proved in the special energy and maximum norms. The res...

متن کامل

Space-time Domain Decomposition for Parabolic Problems Space-time Domain Decomposition for Parabolic Problems

We analyze a space-time domain decomposition iteration, for a model advection diiusion equation in one and two dimensions. The asymptotic convergence rate is superlinear, and it is governed by the diiusion of the error across the overlap between subdomains. Hence, it depends on both the size of this overlap and the diiusion coeecient in the equation. However, it is independent of the number of ...

متن کامل

Fault Tolerant Domain Decomposition for Parabolic Problems

and that Ω is partitioned into N subdomains Ωj , j = 1..N . The computation of these subdomains is distributed among N Processing Units (PUs) or computers. We anticipate that one or several PUs may stall or get disconnected. We complement the distributed architecture of these N PUs, with S additional PUs called spare processing units. The problem in designing a Fault Tolerant (FT) code that can...

متن کامل

Domain Decomposition Method for Parabolic Problems

Domain decomposition methods are widely used to solve the parabolic partial differential equations with Dirichlet, Neumann, or mixed boundary conditions. Modified implicit prediction (MIP) algorithm is unconditionally stable domain decomposition method. In this paper, the SOR iterative technique is applied to the MIP algorithm and the optimum over-relaxation parameter is provided.

متن کامل

A domain decomposition discretization of parabolic problems

Abstract. In recent years, domain decomposition methods have attracted much attention due to their successful application to many elliptic and parabolic problems. Domain decomposition methods treat problems based on a domain substructuring, which is attractive for parallel computation, due to the independence among the subdomains. In principle, domain decomposition methods may be applied to the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Modelling and Analysis

سال: 2012

ISSN: 1392-6292,1648-3510

DOI: 10.3846/13926292.2012.645891